On the existence of optimum cyclic burst-correcting codes
نویسندگان
چکیده
I N THIS PAPER, a binary code is called a b-burst-correcting code if it can correct any single cyclic burst of length b, or less. If C is an [n, n r] b-burst-correcting code, then the syndromes corresponding to the different cyclic bursts of lengths I b should be nonzero and distinct. Since there are n2b-’ different cyclic bursts of length up to b, it follows that 2’ 2 1 + n2’-‘. Abramson [l] noted that this inequality, along with the fact that n is an integer, implies
منابع مشابه
Three-Dimensional Fire Codes
Binary cyclic three–dimensional array codes that can correct three–dimensional bursts (or clusters ) of errors are considered. The class of binary cyclic three–dimensional burst–error–correcting array codes, called three–dimensional Fire codes, is constructed. Several important properties such as the burst–error–correcting capability and the positions of the parity–check symbols are presented. ...
متن کاملTwo-dimensional burst identification codes and their use in burst correction
N MOST memory devices, information is stored in two I dimensions. In such cases, errors usually take the form of two-dimensional bursts. For example, VLSI RAM chips are sensitive to alpha particles and other radiation effects which can cause two-dimensional bursts of errors. Twodimensional burst correcting codes can be used to combat such errors. Elspas [ l ] has shown that the product of two c...
متن کاملOn a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first define a new “metric” (with slightly different properties than the standard Hamming metric). Using this metric we define a very particular class of codes that we call error-set correcting codes, based on a set of forbidden distances which is a monotone decreasing set. Next we redefine the packing pro...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملBlockwise Repeated Low - Density Burst Error Correcting Linear Codes
The paper presents necessary and sufficient condition on the number of parity-check digits required for the existence of a linear code capable of correcting errors in the form of 2-repeated low-density bursts occurring within a sub-block. An illustration of a code of length 24 correcting all 2-repeated low-density bursts of length 3 or less with weight 2 or less occurring within a sub-block of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1986